Real-time Scheduling on Multi-domain Ring Buses
نویسندگان
چکیده
This paper addresses the problem of scheduling real-time data transactions on the bus of multicore processors. The problem is challenging because the bus allows multiple degrees of transaction concurrency. The number of concurrency degrees depends on how the transactions are routed on the bus. We propose an practical abstraction for the scheduling problem together with two scheduling algorithms. The first algorithm is optimal for scheduling specific transaction sets while the second one induces a good sufficient schedulable utilization bound for general transaction sets.
منابع مشابه
Bus minimization and scheduling of multi-chip systems
This paper considers several diierent algorithms that reduce the required number of buses for multi-chip module design. An eecient polynomial time algorithm that calculates the minimum number of buses needed given a particular schedule is presented. We also present three algorithms that minimize the number of buses during scheduling. Experimental results are shown that illustrate the eeciency o...
متن کاملPublic transport fleet scheduling for minimizing total transfer waiting time
Public transportation has been one of the most important research fields in the two last decades. The purpose of this paper is to create a schedule for public transport fleets such as buses and metro trains with the goal of minimizing the total transfer waiting time. We extend previous research works in the field of transit schedule with considering headways of each route as decision variables....
متن کاملBus Minimization and Scheduling of Multi-chip Modules
Multi-Chip Module design is an increasingly common design style for integrated circuits. The area taken up by buses in a multi-chip module design has a signiicant eeect on the size of the circuit. This paper considers several diierent methods that reduce the required number of buses. Two models of interchip communication are studied. The rst, called immediate transfer, requires that all values ...
متن کاملModified Pareto archived evolution strategy for the multi-skill project scheduling problem with generalized precedence relations
In this research, we study the multi-skill resource-constrained project scheduling problem, where there are generalized precedence relations between project activities. Workforces are able to perform one or several skills, and their efficiency improves by repeating their skills. For this problem, a mathematical formulation has been proposed that aims to optimize project completion time, reworki...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کامل